// https://leetcode.cn/problems/longest-uncommon-subsequence-i/?envType=daily-question&envId=2024-06-16
class Solution {
public:
    int findLUSlength(string a, string b) {
        // if(a.size() != b.size()){
        //     return max(a.size,b.size);
        // }
        if(a == b){
            return -1;
        }else{
            return max(a.size(),b.size());
        }
    }
};